Core Discussion Paper 9947 a Faster Capacity Scaling Algorithm for Minimum Cost Submodular Flow
نویسندگان
چکیده
We describe an O(nh min{log U, n log n}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds–Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a relaxation parameter δ. Capacities are relaxed by attaching a complete directed graph with uniform arc capacity δ in each scaling phase. We then modify a feasible submodular flow by relaxing the submodular constraints, so that complementary slackness is satisfied. This creates discrepancies between the boundary of the flow and the base polytope of a relaxed submodular function. To reduce these discrepancies, we use a variant of the successive shortest path algorithm that augments flow along min cost paths of residual capacity at least δ. The shortest augmenting path subroutine we use is a variant of Dijkstra’s algorithm modified to handle exchange capacity arcs efficiently. The result is a weakly polynomial time algorithm whose running time is better than any existing submodular flow algorithm when U is small and C is big. We also show how to use max mean cuts to make the algorithm strongly polynomial. The resulting algorithm is the first capacity scaling algorithm to match the current best strongly polynomial bound for submodular flow.
منابع مشابه
A Capacity Scaling Algorithm for M-convex Submodular Flow
This paper presents a faster algorithm for the M-convex submodular flow problem, which is a generalization of the minimum-cost flow problem with an M-convex cost function for the flow-boundary, where an M-convex function is a nonlinear nonseparable discrete convex function on integer points. The algorithm extends the capacity scaling approach for the submodular flow problem by Fleischer, Iwata ...
متن کاملA faster capacity scaling algorithm for minimum cost submodular flow
We describe an O(nhmin{logU, n log n}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds–Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a relaxation parameter δ. Capacities are relaxed by attaching a complete directed graph with uniform...
متن کاملCapacity scaling algorithm for scalable M-convex submodular flow problems
An M-convex function is a nonlinear discrete function defined on integer points introduced by Murota in 1996, and the M-convex submodular flow problem is one of the most general frameworks of efficiently solvable combinatorial optimization problems. It includes the minimum cost flow and the submodular flow problems as its special cases. In this paper, we first devise a successive shortest path ...
متن کاملA Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
This paper presents a new strongly polynomial cut canceling algorithm for minimum cost submodular flow. The algorithm is a generalization of our similar cut canceling algorithm for ordinary min-cost flow. The algorithm scales a relaxed optimality parameter, and creates a second, inner relaxation that is a kind of submodular max flow problem. The outer relaxation uses a novel technique for relax...
متن کامل